Polynomial programming using Groebner Bases
نویسندگان
چکیده
Finding the global optimal solution for a general nonlinear program is a diicult task except for very small problems. In this paper we identify a class of non-linear programming problems called polynomial programming problems (PP). A polynomial program is an optimization problem with a scalar polynomial objective function and a set of polynomial constraints. By using Groebner Bases, we can determine the global minimum of a polynomial program in a reasonable amount of time and memory.
منابع مشابه
Groebner Bases Computation in Boolean Rings is P-SPACE
The theory of Groebner Bases, which has recently been honored with the ACM Paris Kanellakis Theory and Practice Award, has become a crucial building block to computer algebra, and is widely used in science, engineering, and computer science. It is wellknown that Groebner bases computation is EXP-SPACE in a general polynomial ring setting. However, for many important applications in computer sci...
متن کاملGroebner Bases in Non-Commutative Algebras
INTRODUCTION Recently, the use of Groebner bases and Buchberger algorithm [BUC1,2,4] has been generalised from the case of commutative polynomials to finitely generated algebras R over a field k, R = k, s.t. for each i < j, for some cij ∈ k, for some commutative polynomial pij ∈ k[X1,...,Xn], one has xj xi cij xi xj = pij(x1,...,xn). The first results in this direction were due to Ga...
متن کاملGroebner Bases Computation in Boolean Rings for Symbolic Model Checking
Model checking is an algorithmic approach for automatically verifying whether a hardware or software system functions correctly. Typically, computation is carried over Boolean algebras using binary decision diagrams (BDDs) or satisfiability (SAT) solvers. In this paper we show that computation for model checking can also be carried over the dual Boolean rings of the Boolean algebras by means of...
متن کاملConstruction of Gröbner Bases: Avoiding S-Polynomials – Buchberger’s First Criterium
We continue the formalization of Groebner bases following the book “Groebner Bases – A Computational Approach to Commutative Algebra” by Becker and Weispfenning. Here we prove Buchberger’s first criterium on avoiding S-polynomials: S-polynomials for polynomials with disjoint head terms need not be considered when constructing Groebner bases. In the course of formalizing this theorem we also int...
متن کاملThe Groebner Factorizer and Polynomial System Solving Talk given at the Special Semester on Groebner Bases
the set of common zeroes of the system B over an algebraically closed extension K of k. Splitting the system into smaller ones, solving them separately, and patching all solutions together is often a good guess for a quick solution of even highly nontrivial problems. This can be done by several techniques, e.g., characteristic sets, resultants, the Groebner factorizer or some ad hoc methods. Of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994